package com.kobe.algorithm.niue.qipan;

/**
 * @author ：caopengfei
 * @date ：2021/5/9
 */
public class Main {

    public static void main(String[] args) {
        int m = 2;
        int n = 2;
        int [][] graph = new int[m][n];



    }

    private void dfs(int [][] graph,int x ,int y){

/*        Integer.parseInt()

        graph[x][y] = 1;
        if(graph[0]){

        }
        //香油遍历
        dfs(graph,x+1,y);
        //向下遍历
        dfs(graph,x,y-1);*/

    }



}
